Planar Linkages and Algebraic Sets
نویسنده
چکیده
An abstract linkage is a one dimensional simplicial complex L with a positive number `(vw) assigned to each edge vw. A planar realization of an abstract linkage (L, `) is a mapping φ from the vertices of L to C so that |φ(v) − φ(w)| = `(vw) for all edges vw. We will investigate the topology of the space of planar realizations of linkages. You may think of an abstract linkage as an ideal mechanical device consisting of a bunch of stiff rods (the edges) with length given by ` and sometimes attached at their ends by rotating joints. A planar realization is some way of placing this linkage in the plane. If L is a finite graph, we let V(L) denote the set of vertices of L and let E(L) denote the set of edges of L. We will often wish to fix some of the vertices of a linkage whenever we take a planar realization. So we say that a linkage L is a foursome (L, `, V, μ) where (L, `) is an abstract linkage, V ⊂ V(L) is a subset of its vertices, and μ : V → C. So V is the set of fixed vertices and μ tells where to fix them. The configuration space of realizations is defined by:
منابع مشابه
Universality theorems for configuration spaces of planar linkages
We prove realizability theorems for vector-valued polynomial mappings, real-algebraic sets and compact smooth manifolds by moduli spaces of planar linkages. We also establish a relation between universality theorems for moduli spaces of mechanical linkages and projective arrangements.
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملPosition Analysis of Spherical Linkages via Angle-Bound Smoothing
Distance-bound smoothing is a method to characterize point configurations satisfying a given set of constraints on the pairwise ranges of distances. This technique essentially consists in the iterative application of a set of algebraic conditions to reduce the given initial distance ranges. Although originally developed in a Computational Chemistry context, it has successfully been applied to p...
متن کاملA Free-Algebraic Solution for the Planar Approximation
An explicit solution for the generating functional of n-point functions in the planar approximation is given in terms of two sets of free-algebraic annihilation and creation operators.
متن کاملOptimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms
This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...
متن کامل